Min-degree constrained minimum spanning tree problem: New formulation via Miller–Tucker–Zemlin constraints
نویسندگان
چکیده
منابع مشابه
Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints
Available online 24 March 2009
متن کاملTítulo: An implicit enumerative algorithm for solving the min-degree constrained minimum spanning tree problem
Given a weighted undirected graph G=(V,E) with positive costs on the edges and a positive constant d, the min-degree constrained minimum spanning tree problem is to find a minimum cost spanning tree T of G where each node I of T either has degree at least d or is a leaf node. Thus, the goal is to find a spanning tree T where all its non-leaf nodes (or central nodes) have degree at least d. Thes...
متن کاملMin-degree constrained minimum spanning tree problem: complexity, properties, and formulations
Given an undirected graph G = (V,E) and a function d : V → N , the Min-Degree Constrained Minimum Spanning Tree (md-MST) problem is to find a minimum cost spanning tree T of G where each node i ∈ V has minimum degree d(i) or is a leaf node. This problem is closely related with the well-known Degree Constrained Minimum Spanning Tree (d-MST) problem, where the degree constraint is an upper limit ...
متن کاملNew formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints
0377-2217/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.ejor.2011.01.051 ⇑ Corresponding author. Tel.: +90 312 29
متن کاملCross Decomposition of the Degree-Constrained Minimum Spanning Tree problem
As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those networks becomes more evident. One of the critical issues in the network design process is the topological design problem involved in establishing a centralized data communication network with best performance and low costs. It can be recognized as a degree-constrained minim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2010
ISSN: 0305-0548
DOI: 10.1016/j.cor.2009.03.006